Method for performing multiply-substrate operations on packed data

ABSTRACT

A method and apparatus for including in a processor instructions for performing multiply-subtract operations on packed data. In one embodiment, a processor is coupled to a memory. The memory has stored therein a first packed data and a second packed data. The processor performs operations on data elements in said first packed data and said second packed data to generate a third packed data in response to receiving an instruction. At least one of the data elements in this third packed data storing the result of performing a multiply-subtract operation on data elements in the first and second packed data.

This is a continuation of application Ser. No. 08/554,625 filed Nov. 6,1995 now U.S. Pat. No. 5,721,892, which is a continuation of applicationSer. No. 08/521,803, filed Aug. 31, 1995, abandoned.

CROSS-REFERENCE TO RELATED APPLICATION

Ser. No. 08/522,067, titled "A Method for Performing Multiply-AddOperations on Packed Data," filed Aug. 31, 1995, by Alexander D. Peleg,Millind Mittal, Larry M. Mennemeier, Benny Eitan, Carole Dulong, EiichiKowashi, and Wolf Witt. Application Ser. No. 08/551,196, titled "AnApparatus for Performing Multiply-Add Operations on Packed Data," filedOct. 31, 1995, by Alexander D. Peleg, et al.

BACKGROUND OF THE INVENTION

1. FIELD OF INVENTION

In particular, the invention relates to the field of computer systems.More specifically, the invention relates to the area of packed dataoperations.

2. DESCRIPTION OF RELATED ART

In typical computer systems, processors are implemented to operate onvalues represented by a large number of bits (e.g., 64) usinginstructions that produce one result. For example, the execution of anadd instruction will add together a first 64-bit value and a second64-bit value and store the result as a third 64-bit value. However,multimedia applications (e.g., applications targeted at computersupported cooperation (CSC--the integration of teleconferencing withmixed media data manipulation), 2D/3D graphics, image processing, videocompression/decompression, recognition algorithms and audiomanipulation) require the manipulation of large amounts of data whichmay be represented in a small number of bits. For example, graphicaldata typically requires 8 or 16 bits and sound data typically requires 8or 16 bits. Each of these multimedia application requires one or morealgorithms, each requiring a number of operations. For example, analgorithm may require an add, compare and shift operation.

To improve efficiency of multimedia applications (as well as otherapplications that have the same characteristics), prior art processorsprovide packed data formats. A packed data format is one in which thebits typically used to represent a single value are broken into a numberof fixed sized data elements, each of which represents a separate value.For example, a 64-bit register may be broken into two 32-bit elements,each of which represents a separate 32-bit value. In addition, theseprior art processors provide instructions for separately manipulatingeach element in these packed data types in parallel. For example, apacked add instruction adds together corresponding data elements from afirst packed data and a second packed data. Thus, if a multimediaalgorithm requires a loop containing five operations that must beperformed on a large number of data elements, it is desirable to packthe data and perform these operations in parallel using packed datainstructions. In this manner, these processors can more efficientlyprocess multimedia applications.

However, if the loop of operations contains an operation that cannot beperformed by the processor on packed data (i.e., the processor lacks theappropriate instruction), the data will have to be unpacked to performthe operation. For example, if the multimedia algorithm requires an addoperation and the previously described packed add instruction is notavailable, the programmer must unpack both the first packed data and thesecond packed data (i.e., separate the elements comprising both thefirst packed data and the second packed data), add the separatedelements together individually, and then pack the results into a packedresult for further packed processing. The processing time required toperform such packing and unpacking often negates the performanceadvantage for which packed data formats are provided. Therefore, it isdesirable to incorporate in a computer system a set of packed datainstructions that provide all the required operations for typicalmultimedia algorithms. However, due to the limited die area on today'sgeneral purpose microprocessors, the number of instructions which may beadded is limited. Therefore, it is desirable to invent instructions thatprovide both versatility (i.e. instructions which may be used in a widevariety of multimedia algorithms) and the greatest performanceadvantage.

One prior art technique for providing operations for use in multimediaalgorithms is to couple a separate digital signaling processor (DSP) toan existing general purpose processor (e.g., The Intel® 486 manufacturedby Intel Corporation of Santa Clara, Calif.). The general purposeprocessor allocates jobs that can be performed using packed data (e.g.,video processing) to the DSP.

One such prior art DSP includes a multiply accumulate instruction thatadds to an accumulation value the results of multiplying together twovalues. (see Kawakami, Yuichi, et al., "A Single-Chip Digital SignalProcessor for Voiceband Applications", IEEE International Solid-StateCircuits Conference, 1980, pp. 40-41). An example of the multiplyaccumulate operation for this DSP is shown below in Table 1, where theinstruction is performed on the data values A₁ and B₁ accessed asSource1 and Source2, respectively.

                  TABLE 1    ______________________________________     ##STR1##    ______________________________________

One limitation of this prior art instruction is its limitedefficiency--i.e., it only operates on 2 values and an accumulationvalue. For example, to multiply and accumulate two sets of 2 valuesrequires the following 2 instructions performed serially: 1) multiplyaccumulate the first value from the first set, the first value from thesecond set, and an accumulation value of zero to generate anintermediate accumulation value; 2) multiply accumulate the second valuefrom the first set, the second value from the second set, and theintermediate accumulation value to generate the result.

Another prior art DSP includes a multiply accumulate instruction thatoperates on two sets of two values and an accumulation value (See"Digital Signal Processor with Parallel Multipliers", U.S. Pat. No.4,771,379--referred to herein as the "Ando et al." reference). Anexample of the multiply accumulate instruction for this DSP is shownbelow in Table 2, where the instruction is performed on the data valuesA₁, A₂, B₁ and B₂ accessed as Source1-4, repectively.

                  TABLE 2    ______________________________________     ##STR2##    ______________________________________

Using this prior art technique, two sets of 2 values are multiplied andthen added to an accumulation value in one instruction.

This multiply accumulate instruction has limited versatility because italways adds to the accumulation value. As a result, it is difficult touse the instruction for operations other than multiply accumulate. Forexample, the multiplication of complex numbers is commonly used inmultimedia applications. The multiplication of two complex number (e.g.,r₁ i₁ and r₂ i₂) is performed according to the following equation:

    Real Component=r.sub.1 ·r.sub.2 -i.sub.1 ·i.sub.2

    Imaginary Component=r.sub.1 ·i.sub.2 +r.sub.2 ·i.sub.1

This prior art DSP cannot perform the function of multiplying togethertwo complex numbers using one multiply accumulate instruction.

The limitations of this multiply accumulate instruction can be moreclearly seen when the result of such a calculation is needed in asubsequent multiplication operation rather than an accumulation. Forexample, if the real component were calculated using this prior art DSP,the accumulation value would need to be initialized to zero in order tocorrectly compute the result. Then the accumulation value would againneed to be initialized to zero in order to calculate the imaginarycomponent. To perform another complex multiplication on the resultingcomplex number and a third complex number (e.g., r3, i3), the resultingcomplex number must be rescaled and stored into the acceptable memoryformat and the accumulation value must again be initialized to zero.Then, the complex multiplication can be performed as described above. Ineach of these operations the ALU, which is devoted to the accumulationvalue, is superfluous hardware and extra instructions are needed tore-initialize this accumulation value. These extra instructions wouldotherwise have been unnecessary.

A further limitation of this prior art technique is that the data mustbe accessed through expensive multi-ported memory. This is because themultipliers are connected directly with data memories. Therefore theamount of parallelism which can be exploited is limited to a smallnumber by the cost of the interconnection, and the fact that thisinterconnection is not decoupled from the instruction.

The Ando, et al. reference also describes that an alternative to thisexpensive interconnection is to introduce a delay for each subsequentpair of data to be multiplied. This solution diminishes any performanceadvantages to those provided by the solution previously shown in Table1.

Furthermore, the notion of multi-ported memory or of pipelined accessesto memory entails the use of multiple addresses. This explicit use ofone address per datum, clearly demonstrates that the critical notion ofpacked data is not employed in this prior art.

SUMMARY OF THE INVENTION

A method and apparatus for including in a processor instructions forperforming multiply-subtract operations on packed data is described. Inone embodiment, a processor is coupled to a memory. The memory hasstored therein a first packed data and a second packed data. Theprocessor performs operations on data elements in said first packed dataand said second packed data to generate a third packed data in responseto receiving an instruction. At least one of the data elements in thisthird packed data storing the result of performing a multiply-subtractoperation on data elements in the first and second packed data.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention is illustrated by way of example, and not limitation, inthe figures. Like references indicate similar elements.

FIG. 1 illustrates an exemplary computer system according to oneembodiment of the invention.

FIG. 2 illustrates a register file of the processor according to oneembodiment of the invention.

FIG. 3 is a flow diagram illustrating the general steps used by theprocessor to manipulate data according to one embodiment of theinvention.

FIG. 4 illustrates packed data-types according to one embodiment of theinvention.

FIG. 5a illustrates in-register packed data representations according toone embodiment of the invention.

FIG. 5b illustrates in-register packed data representations according toone embodiment of the invention.

FIG. 5c illustrates in-register packed data representations according toone embodiment of the invention.

FIG. 6a illustrates a control signal format for indicating the use ofpacked data according to one embodiment of the invention.

FIG. 6b illustrates a second control signal format for indicating theuse of packed data according to one embodiment of the invention.

FIG. 7 is a flow diagram illustrating a method for performingmultiply-add and multiply-subtract operations on packed data accordingto one embodiment of the invention.

FIG. 8 illustrates a circuit for performing multiply-add and/ormultiply-subtract operations on packed data according to one embodimentof the invention.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth toprovide a thorough understanding of the invention. However, it isunderstood that the invention may be practiced without these specificdetails. In other instances, well-known circuits, structures andtechniques have not been shown in detail in order not to obscure theinvention.

DEFINITIONS

To provide a foundation for understanding the description of theembodiments of the invention, the following definitions are provided.

Bit X through Bit Y:

defines a subfield of binary number. For example, bit six through bitzero of the byte 00111010₂ (shown in base two) represent the subfield111010₂. The `₂ ` following a binary number indicates base 2. Therefore,1000₂ equals 8₁₀, while F₁₆ equals 15₁₀.

R_(x) :

is a register. A register is any device capable of storing and providingdata. Further functionality of a register is described below. A registeris not necessarily, included on the same die or in the same package asthe processor.

SRC1, SRC2, and DEST:

identify storage areas (e.g., memory addresses, registers, etc.)

Source1-i and Result1-i:

represent data.

OVERVIEW

This application describes a method and apparatus for including in aprocessor instructions for performing multiply-add and multiply-subtractoperations on packed data. In one embodiment, two multiply-addoperations are performed using a single multiply-add instruction asshown below in Table 3a and Table 3b--Table 3a shows a simplifiedrepresentation of the disclosed multiply-add instruction, while Table 3bshows a bit level example of the disclosed multiply-add instruction.

                  TABLE 3a    ______________________________________     ##STR3##    ______________________________________

                                      TABLE 3b    __________________________________________________________________________     ##STR4##    __________________________________________________________________________

Thus, the described embodiment of the multiple-add instructionmultiplies together corresponding 16-bit data elements of Source1 andSource2 generating four 32-bit intermediate results. These 32-bitintermediate results are summed by pairs producing two 32-bit resultsthat are packed into their respective elements of a packed result. Asfurther described later, alternative embodiment may vary the number ofbits in the data elements, intermediate results, and results. Inaddition, alternative embodiment may vary the number of data elementsused, the number of intermediate results generated, and the number ofdata elements in the resulting packed data. The multiply-subtractoperation is the same as the multiply-add operation, except the adds arereplaced with subtracts. The operation of an example multiply-subtractinstruction is shown below in Table 4.

                  TABLE 4    ______________________________________     ##STR5##    ______________________________________

Of course, alternative embodiments may implement varitaions of theseinstructions in which at least one multiply-add operation or onemultiply-subtract operation is performed. For example, one alternativeembodiment implements and instruction which performs one mulitply-addoperation and one multiply-subtract operation. In another alternativeembodiment, an instruction is implemented which performs onemultiply-add operation or one multiply-subtract operation and some otheroperation.

COMPUTER SYSTEM

FIG. 1 illustrates an exemplary computer system 100 according to oneembodiment of the invention. Computer system 100 includes a bus 101, orother communications hardware and software, for communicatinginformation, and a processor 109 coupled with bus 101 for processinginformation. Processor 109 represents a central processing unit of anytype of architecture, including a CISC or RISC type architecture.Computer system 100 further includes a random access memory (RAM) orother dynamic storage device (referred to as main memory 104), coupledto bus 101 for storing information and instructions to be executed byprocessor 109. Main memory 104 also may be used for storing temporaryvariables or other intermediate information during execution ofinstructions by processor 109. Computer system 100 also includes a readonly memory (ROM) 106, and/or other static storage device, coupled tobus 101 for storing static information and instructions for processor109. Data storage device 107 is coupled to bus 101 for storinginformation and instructions.

FIG. 1 also illustrates that processor 109 includes an execution unit130, a register file 150, a cache 160, a decoder 165, and an internalbus 170. Of course, processor 109 contains additional circuitry which isnot necessary to understanding the invention.

Execution unit 130 is used for executing instructions received byprocessor 109. In addition to recognizing instructions typicallyimplemented in general purpose processors, execution unit 130 recognizesinstructions in packed instruction set 140 for performing operations onpacked data formats. Packed instruction set 140 includes instructionsfor supporting multiply-add and/or multiply-subtract operations. Inaddition, packed instruction set 140 may also include instructions forsupporting a pack operation, an unpack operation, a packed addoperation, a packed subtract operation, a packed multiply operation, apacked shift operation, a packed compare operation, a population countoperation, and a set of packed logical operations (including packed AND,packed ANDNOT, packed OR, and packed XOR) as described in "A Set ofInstructions for Operating on Packed Data," filed on Aug. 31, 1995,application Ser. No. 08/521,360.

Execution unit 130 is coupled to register file 150 by internal bus 170.Register file 150 represents a storage area on processor 109 for storinginformation, including data. It is understood that one aspect of theinvention is the described instruction set for operating on packed data.According to this aspect of the invention, the storage area used forstoring the packed data is not critical. However, one embodiment of theregister file 150 is later described with reference to FIG. 2. Executionunit 130 is coupled to cache 160 and decoder 165. Cache 160 is used tocache data and/or control signals from, for example, main memory 104.Decoder 165 is used for decoding instructions received by processor 109into control signals and/or microcode entry points. In response to thesecontrol signals and/or microcode entry points, execution unit 130performs the appropriate operations. For example, if an add instructionis received, decoder 165 causes execution unit 130 to perform therequired addition; if a subtract instruction is received, decoder 165causes execution unit 130 to perform the required subtraction; etc.Decoder 165 may be implemented using any number of different mechanisms(e.g., a look-up table, a hardware implementation, a PLA, etc.). Thus,while the execution of the various instructions by the decoder andexecution unit is represented by a series of if/then statements, it isunderstood that the execution of an instruction does not require aserial processing of these if/then statements. Rather, any mechanism forlogically performing this if/then processing is considered to be withinthe scope of the invention.

FIG. 1 additionally shows a data storage device 107, such as a magneticdisk or optical disk, and its corresponding disk drive, can be coupledto computer system 100. Computer system 100 can also be coupled via bus101 to a display device 121 for displaying information to a computeruser. Display device 121 can include a frame buffer, specializedgraphics rendering devices, a cathode ray tube (CRT), and/or a flatpanel display. An alphanumeric input device 122, including alphanumericand other keys, is typically coupled to bus 101 for communicatinginformation and command selections to processor 109. Another type ofuser input device is cursor control 123, such as a mouse, a trackball, apen, a touch screen, or cursor direction keys for communicatingdirection information and command selections to processor 109, and forcontrolling cursor movement on display device 121. This input devicetypically has two degrees of freedom in two axes, a first axis (e.g., x)and a second axis (e.g., y), which allows the device to specifypositions in a plane. However, this invention should not be limited toinput devices with only two degrees of freedom.

Another device which may be coupled to bus 101 is a hard copy device 124which may be used for printing instructions, data, or other informationon a medium such as paper, film, or similar types of media.Additionally, computer system 100 can be coupled to a device for soundrecording, and/or playback 125, such as an audio digitizer coupled to amicrophone for recording information. Further, the device may include aspeaker which is coupled to a digital to analog (D/A) converter forplaying back the digitized sounds.

Also, computer system 100 can be a terminal in a computer network (e.g.,a LAN). Computer system 100 would then be a computer subsystem of acomputer network. Computer system 100 optionally includes videodigitizing device 126. Video digitizing device 126 can be used tocapture video images that can be transmitted to others on the computernetwork.

In one embodiment, the processor 109 additionally supports aninstruction set which is compatible with the x86 instruction set used byexisting processors (such as the Pentium® processor) manufactured byIntel Corporation of Santa Clara, Calif. Thus, in one embodiment,processor 109 supports all the operations supported in the IA™--IntelArchitecture, as defined by Intel Corporation of Santa Clara, Calif.(see Microprocessors, Intel Data Books volume 1 and volume 2, 1992 and1993, available from Intel of Santa Clara, Calif.). As a result,processor 109 can support existing x86 operations in addition to theoperations of the invention. While the invention is described as beingincorporated into an x86 based instruction set, alternative embodimentscould incorporate the invention into other instruction sets. Forexample, the invention could be incorporated into a 64-bit processorusing a new instruction set.

FIG. 2 illustrates the register file of the processor according to oneembodiment of the invention. The register file 150 is used for storinginformation, including control/status information, integer data,floating point data, and packed data. In the embodiment shown in FIG. 2,the register file 150 includes integer registers 201, registers 209,status registers 208, and instruction pointer register 211. Statusregisters 208 indicate the status of processor 109. Instruction pointerregister 211 stores the address of the next instruction to be executed.Integer registers 201, registers 209, status registers 208, andinstruction pointer register 211 are all coupled to internal bus 170.Any additional registers would also be coupled to internal bus 170.

In one embodiment, the registers 209 are used for both packed data andfloating point data. In one such embodiment, the processor 109, at anygiven time, must treat the registers 209 as being either stackreferenced floating point registers or non-stack referenced packed dataregisters. In this embodiment, a mechanism is included to allow theprocessor 109 to switch between operating on registers 209 as stackreferenced floating point registers and non-stack referenced packed dataregisters. In another such embodiment, the processor 109 maysimultaneously operate on registers 209 as non-stack referenced floatingpoint and packed data registers. As another example, in anotherembodiment, these same registers may be used for storing integer data.

Of course, alternative embodiments may be implemented to contain more orless sets of registers. For example, an alternative embodiment mayinclude a separate set of floating point registers for storing floatingpoint data. As another example, an alternative embodiment may includinga first set of registers, each for storing control/status information,and a second set of registers, each capable of storing integer, floatingpoint, and packed data. As a matter of clarity, the registers of anembodiment should not be limited in meaning to a particular type ofcircuit. Rather, a register of an embodiment need only be capable ofstoring and providing data, and performing the functions describedherein.

The various sets of registers (e.g., the integer registers 201, theregisters 209) may be implemented to include different numbers ofregisters and/or to different size registers. For example, in oneembodiment, the integer registers 201 are implemented to storethirty-two bits, while the registers 209 are implemented to store eightybits (all eighty bits are used for storing floating point data, whileonly sixty-four are used for packed data). In addition, registers 209contains eight registers, R₀ 212a through R₇ 212h. R₁ 212a, R₂ 212b andR₃ 212c are examples of individual registers in registers 209.Thirty-two bits of a register in registers 209 can be moved into aninteger register in integer registers 201. Similarly, a value in aninteger register can be moved into thirty-two bits of a register inregisters 209. In another embodiment, the integer registers 201 eachcontain 64 bits, and 64 bits of data may be moved between the integerregister 201 and the registers 209.

FIG. 3 is a flow diagram illustrating the general steps are used by theprocessor to manipulate data according to one embodiment of theinvention. That is, FIG. 3 illustrates the steps followed by processor109 while performing an operation on packed data, performing anoperation on unpacked data, or performing some other operation. Forexample, such operations include a load operation to load a register inregister file 150 with data from cache 160, main memory 104, read onlymemory (ROM) 106, or data storage device 107.

At step 301, the decoder 165 receives a control signal from either thecache 160 or bus 101. Decoder 165 decodes the control signal todetermine the operations to be performed.

At step 302, Decoder 165 accesses the register file 150, or a locationin memory. Registers in the register file 150, or memory locations inthe memory, are accessed depending on the register address specified inthe control signal. For example, for an operation on packed data, thecontrol signal can include SRC1, SRC2 and DEST register addresses. SRC1is the address of the first source register. SRC2 is the address of thesecond source register. In some cases, the SRC2 address is optional asnot all operations require two source addresses. If the SRC2 address isnot required for an operation, then only the SRC1 address is used. DESTis the address of the destination register where the result data isstored. In one embodiment, SRC1 or SRC2 is also used as DEST. SRC1, SRC2and DEST are described more fully in relation to FIG. 6a and FIG. 6b.The data stored in the corresponding registers is referred to asSource1, Source2, and Result respectively. Each of these data issixty-four bits in length.

In another embodiment of the invention, any one, or all, of SRC1, SRC2and DEST, can define a memory location in the addressable memory spaceof processor 109. For example, SRC1 may identify a memory location inmain memory 104, while SRC2 identifies a first register in integerregisters 201 and DEST identifies a second register in registers 209.For simplicity of the description herein, the invention will bedescribed in relation to accessing the register file 150. However, theseaccesses could be made to memory instead.

At step 303, execution unit 130 is enabled to perform the operation onthe accessed data. At step 304, the result is stored back into registerfile 150 according to requirements of the control signal.

DATA AND STORAGE FORMATS

FIG. 4 illustrates packed data-types according to one embodiment of theinvention. Three packed data formats are illustrated; packed byte 401,packed word 402, and packed doubleword 403. Packed byte, in oneembodiment of the invention, is sixty-four bits long containing eightdata elements. Each data element is one byte long. Generally, a dataelement is an individual piece of data that is stored in a singleregister (or memory location) with other data elements of the samelength. In one embodiment of the invention, the number of data elementsstored in a register is sixty-four bits divided by the length in bits ofa data element.

Packed word 402 is sixty-four bits long and contains four word 402 dataelements. Each word 402 data element contains sixteen bits ofinformation.

Packed doubleword 403 is sixty-four bits long and contains twodoubleword 403 data elements. Each doubleword 403 data element containsthirty-two bits of information.

FIGS. 5a through 5c illustrate the in-register packed data storagerepresentation according to one embodiment of the invention. Unsignedpacked byte in-register representation 510 illustrates the storage of anunsigned packed byte 401 in one of the registers R₀ 212a through R₇212h. Information for each byte data element is stored in bit seventhrough bit zero for byte zero, bit fifteen through bit eight for byteone, bit twenty-three through bit sixteen for byte two, bit thirty-onethrough bit twenty-four for byte three, bit thirty-nine through bitthirty-two for byte four, bit forty-seven through bit forty for bytefive, bit fifty-five through bit forty-eight for byte six and bitsixty-three through bit fifty-six for byte seven. Thus, all availablebits are used in the register. This storage arrangement increases thestorage efficiency of the processor. As well, with eight data elementsaccessed, one operation can now be performed on eight data elementssimultaneously. Signed packed byte in-register representation 511illustrates the storage of a signed packed byte 401. Note that theeighth bit of every byte data element is the sign indicator.

Unsigned packed word in-register representation 512 illustrates how wordthree through word zero are stored in one register of registers 209. Bitfifteen through bit zero contain the data element information for wordzero, bit thirty-one through bit sixteen contain the information fordata element word one, bit forty-seven through bit thirty-two containthe information for data element word two and bit sixty-three throughbit forty-eight contain the information for data element word three.Signed packed word in-register representation 513 is similar to theunsigned packed word in-register representation 512. Note that thesixteenth bit of each word data element is the sign indicator.

Unsigned packed doubleword in-register representation 514 shows howregisters 209 store two doubleword data elements. Doubleword zero isstored in bit thirty-one through bit zero of the register. Doublewordone is stored in bit sixty-three through bit thirty-two of the register.Signed packed doubleword in-register representation 515 is similar tounsigned packed doubleword in-register representation 514. Note that thenecessary sign bit is the thirty-second bit of the doubleword dataelement.

As mentioned previously, registers 209 may be used for both packed dataand floating point data. In this embodiment of the invention, theindividual programming processor 109 may be required to track whether anaddressed register, R₀ 212a for example, is storing packed data orfloating point data. In an alternative embodiment, processor 109 couldtrack the type of data stored in individual registers of registers 209.This alternative embodiment could then generate errors if, for example,a packed addition operation were attempted on floating point data.

CONTROL SIGNAL FORMATS

The following describes one embodiment of the control signal formatsused by processor 109 to manipulate packed data. In one embodiment ofthe invention, control signals are represented as thirty-two bits.Decoder 165 may receive the control signal from bus 101. In anotherembodiment, decoder 165 can also receive such control signals from cache160.

FIG. 6a illustrates a control signal format for indicating the use ofpacked data according to one embodiment of the invention. Operationfield OP 601, bit thirty-one through bit twenty-six, providesinformation about the operation to be performed by processor 109; forexample, packed addition, packed subtraction, etc. SRC1 602, bittwenty-five through twenty, provides the source register address of aregister in registers 209. This source register contains the firstpacked data, Source1, to be used in the execution of the control signal.Similarly, SRC2 603, bit nineteen through bit fourteen, contains theaddress of a register in registers 209. This second source registercontains the packed data, Source2, to be used during execution of theoperation. DEST 605, bit five through bit zero, contains the address ofa register in registers 209. This destination register will store theresult packed data, Result, of the packed data operation.

Control bits SZ 610, bit twelve and bit thirteen, indicates the lengthof the data elements in the first and second packed data sourceregisters. If SZ 610 equals 01₂, then the packed data is formatted aspacked byte 401. If SZ 610 equals 10₂, then the packed data is formattedas packed word 402. SZ 610 equaling 00₂ or 11₂ is reserved, however, inanother embodiment, one of these values could be used to indicate packeddoubleword 403.

Control bit T 611, bit eleven, indicates whether the operation is to becarried out with saturate mode. If T 611 equals one, then a saturatingoperation is performed. If T 611 equals zero, then a non-saturatingoperation is performed. Saturating operations will be described later.

Control bit S 612, bit ten, indicates the use of a signed operation. IfS 612 equals one, then a signed operation is performed. If S 612 equalszero, then an unsigned operation is performed.

FIG. 6b illustrates a second control signal format for indicating theuse of packed data according to one embodiment of the invention. Thisformat corresponds with the general integer opcode format described inthe "Pentium Processor Family User's Manual," available from IntelCorporation, Literature Sales, P.O. Box 7641, Mt. prospect, Ill.,60056-7641. Note that OP 601, SZ 610, T 611, and S 612 are all combinedinto one large field. For some control signals, bits three through fiveare SRC 1 602. In one embodiment, where there is a SRC 1 602 address,then bits three through five also correspond to DEST 605. In analternate embodiment, where there is a SRC2 603 address, then bits zerothrough two also correspond to DEST 605. For other control signals, likea packed shift immediate operation, bits three through five represent anextension to the opcode field. In one embodiment, this extension allowsa programmer to include an immediate value with the control signal, suchas a shift count value. In one embodiment, the immediate value followsthe control signal. This is described in more detail in the "PentiumProcessor Family User's Manual," in appendix F, pages F-1 through F-3.Bits zero through two represent SRC2 603. This general format allowsregister to register, memory to register, register by memory, registerby register, register by immediate, register to memory addressing. Also,in one embodiment, this general format can support integer register toregister, and register to integer register addressing.

DESCRIPTION OF SATURATE/UNSATURATE

As mentioned previously, T 611 indicates whether operations optionallysaturate. Where the result of an operation, with saturate enabled,overflows or underflows the range of the data, the result will beclamped. Clamping means setting the result to a maximum or minimum valueshould a result exceed the range's maximum or minimum value. In the caseof underflow, saturation clamps the result to the lowest value in therange and in the case of overflow, to the highest value. The allowablerange for each data format is shown in Table 5.

                  TABLE 5    ______________________________________    Data Format   Minimum Value Maximum Value    ______________________________________    Unsigned Byte 0              255    Signed Byte   -128           127    Unsigned Word 0             65535    Signed Word   -32768        32767    Unsigned Doubleword                  0               2.sup.64  - 1    Signed Doubleword                  263             2.sup.63  - 1    ______________________________________

As mentioned above, T 611 indicates whether saturating operations arebeing performed. Therefore, using the unsigned byte data format, if anoperation's result=258 and saturation was enabled, then the result wouldbe clamped to 255 before being stored into the operation's destinationregister. Similarly, if an operation's result=-32999 and processor 109used signed word data format with saturation enabled, then the resultwould be clamped to -32768 before being stored into the operation'sdestination register.

MULTIPLY-ADD/SUBTRACT OPERATION(S)

In one embodiment of the invention, the SRC1 register contains packeddata (Source1), the SRC2 register contains packed data (Source2), andthe DEST register will contain the result (Result) of performing themultiply-add or multiply-subtract instruction on Source1 and Source2. Inthe first step of the multiply-add and multiply-subtract instruction,Source1 will have each data element independently multiplied by therespective data element of Source2 to generate a set of respectiveintermediate results. These intermediate results are summed by pairs togenerate the Result for the multiply-add instruction. In contrast, theseintermediate results are subtracted by pairs to generate the Result forthe multiply-subtract instruction.

In one embodiment of the invention, the multiply-add andmultiply-subtract instructions operate on signed packed data andtruncate the results to avoid any overflows. In addition, theseinstructions operate on packed word data and the Result is a packeddouble word. However, alternative embodiments could support theseinstructions for other packed data types.

FIG. 7 is a flow diagram illustrating a method for performingmultiply-add and multiply-subtract operations on packed data accordingto one embodiment of the invention.

At step 701, decoder 165 decodes the control signal received byprocessor 109. Thus, decoder 165 decodes: the operation code for amultiply-add instruction or a multiply-subtract instruction.

At step 702, via internal bus 170, decoder 165 accesses registers 209 inregister file 150 given the SRC1 602 and SRC2 603 addresses. Registers209 provide execution unit 130 with the packed data stored in the SRC1602 register (Source1), and the packed data stored in SRC2 603 register(Source2). That is, registers 209 communicate the packed data toexecution unit 130 via internal bus 170.

At step 703, decoder 165 enables execution unit 130 to perform theinstruction. If the instruction is a multiply-add instruction, flowpasses to step 714. However, if the instruction is a multiply-subtractinstruction, flow passes to step 715.

In step 714, the following is performed. Source1 bits fifteen throughzero are multiplied by Source2 bits fifteen through zero generating afirst 32-bit intermediate result (Intermediate Result 1). Source1 bitsthirty-one through sixteen are multiplied by Source2 bits thirty-onethrough sixteen generating a second 32-bit intermediate result(Intermediate Result 2). Source1 bits forty-seven through thirty-two aremultiplied by Source2 bits forty-seven through thirty-two generating athird 32-bit intermediate result (Intermediate Result 3). Source1 bitssixty-three through forty-eight are multiplied by Source2 bitssixty-three through forty-eight generating a fourth 32-bit intermediateresult (Intermediate Result 4). Intermediate Result 1 is added toIntermediate Result 2 generating Result bits thirty-one through 0, andIntermediate Result 3 is added to Intermediate Result 4 generatingResult bits sixty-three through thirty-two.

Step 715 is the same as step 714, with the exception that IntermediateResult 1 Intermediate Result 2 are subtracted to generate bitsthirty-one through 0 of the Result, and Intermediate Result 3 andIntermediate Result 4 are subtracted to generate bits sixty-threethrough thirty-two of the Result.

Different embodiments may perform the multiplies and adds/subtractsserially, in parallel, or in some combination of serial and paralleloperations.

At step 720, the Result is stored in the DEST register.

PACKED DATA MULTIPLY-ADD/SUBTRACT CIRCUITS

In one embodiment, the multiply-add and multiply-subtract instructionscan execute on multiple data elements in the same number of clock cyclesas a single multiply on unpacked data. To achieve execution in the samenumber of clock cycles, parallelism is used. That is, registers aresimultaneously instructed to perform the multiply-add/subtractoperations on the data elements. This is discussed in more detail below.

FIG. 8 illustrates a circuit for performing multiply-add and/ormultiply-subtract operations on packed data according to one embodimentof the invention. Operation control 800 processes the control signal forthe multiply-add and multiply-subtract instructions. Operation control800 outputs signals on Enable 880 to control Packedmultiply-adder/subtractor 801.

Packed multiply-adder/subtractor 801 has the following inputs: Source163:0! 831, Source2 63:0! 833, and Enable 880. Packedmultiply-adder/subtractor 801 includes four 16×16 multiplier circuits:16×16 multiplier A 810, 16×16 multiplier B 811, 16×16 multiplier C 812and 16×16 multiplier D 813. 16×16 multiplier A 810 has as inputs Source115:0! and Source2 15:0!. 16×16 multiplier B 811 has as inputs Source131:16! and Source2 31:16!. 16×16 multiplier C 812 has as inputs Source147:32! and Source2 47:32!. 16×16 multiplier D 813 has as inputs Source163:48! and Source2 63:48!. The 32-bit intermediate results generated by16×16 multiplier A 810 and 16×16 multiplier B 811 are received byadder/subtractor 1350, while the 32-bit intermediate results generatedby 16×16 multiplier C 812 and 16×16 multiplier D 813 are received byadder/subtractor 851.

Based on whether the current instruction is a multiply/add ormultiply/subtract instruction, adder/subtractor 850 and adder/subtractor851 add or subtract their respective 32-bit inputs. The output ofadder/subtractor 850 (i.e., Result bits 31 through zero of the Result)and the output of adder/subtractor 851 (i.e., bits 63 through 32 of theResult) are combined into the 64-bit Result and communicated to ResultRegister 871.

In one embodiment, each of adder/subtractor 851 and adder/subtractor 850are composed of four 8-bit adders/subtractors with the appropriatepropagation delays. However, alternative embodiments could implementadder/subtractor 851 and adder/subtractor 850 in any number of ways(e.g., two 32-bit adders/subtractors).

To perform the equivalent of these multiply-add or multiply-subtractinstructions in prior art processors which operate on unpacked data,four separate 64-bit multiply operations and two 64-bit add or subtractoperations, as well as the necessary load and store operations, would beneeded. This wastes data lines and circuitry that are used for the bitsthat are higher than bit sixteen for Source1 and Source 2, and higherthan bit thirty two for the Result. As well, the entire 64-bit resultgenerated by the prior art processor may not be of use to theprogrammer. Therefore, the programmer would have to truncate eachresult.

Performing the equivalent of this multiply-add instruction using theprior art DSP processor described with reference to Table 1 requires oneinstruction to zero the accumulation value and four multiply accumulateinstructions. Performing the equivalent of this multiply-add instructionusing the prior art DSP processor described with reference to Table 2requires one instruction to zero the accumulation value and 2-accumulateinstructions.

ADVANTAGES OF INCLUDING THE DESCRIBED MULTIPLY-ADD INSTRUCTION IN THEINSTRUCTION SET

As previously described, the prior art multiply accumulate instructionsalways add the results of their multiplications to an accumulationvalue. This accumulation value becomes a bottleneck for performingoperations other than multiplying and accumulating (e.g., theaccumulation value must be cleared each time a new set of operations isrequired which do not require the previous accumulation value). Thisaccumulation value also becomes a bottleneck if operations, such asrounding, need to be performed before accumulation.

In contrast, the disclosed multiply-add and multiply-subtractinstructions do not carry forward an accumulation value. As a result,these instructions are easier to use in a wider variety of algorithms.In addition, software pipelining can be used to achieve comparablethroughput. To illustrate the versatility of the multiply-addinstruction, several example multimedia algorithms are described below.Some of these multimedia algorithms use additional packed datainstructions. The operation of these additional packed data instructionsare shown in relation to the described algorithms. For a furtherdescription of these packed data instructions, see "A Set ofInstructions for Operating on Packed Data," filed on Aug. 31, 1995,application Ser. No. 08/521,360. Of course, other packed datainstructions could be used. In addition, a number of steps requiring theuse of general purpose processor instructions to manage data movement,looping, and conditional branching have been omitted in the followingexamples.

1) Multiplication of Complex Numbers

The disclosed multiply-add instruction can be used to multiply twocomplex numbers in a single instruction as shown in Table 6a. Aspreviously described, the multiplication of two complex number (e.g., r₁i₁ and r₂ i₂) is performed according to the following equation:

    Real Component=r.sub.1 ·r.sub.2 -i.sub.1 ·i.sub.2

    Imaginary Component=r.sub.1 ·i.sub.2 +r.sub.2 ·i.sub.1

If this instruction is implemented to be completed every clock cycle,the invention can multiply two complex numbers every clock cycle.

                  TABLE 6a    ______________________________________     ##STR6##    ______________________________________

As another example, Table 6b shows the instructions used to multiplytogether three complex numbers.

                  TABLE 6b    ______________________________________     ##STR7##     ##STR8##     ##STR9##     ##STR10##    ______________________________________

2) Multiply Accumulation Operations

The disclosed multiply-add instructions can also be used to multiply andaccumulate values. For example, two sets of four data elements (A₁₋₄ andB₁₋₄) may be multiplied and accumulated as shown below in Table 7. Inone embodiment, each of the instructions shown in Table 7 is implementedto complete each clock cycle.

                  TABLE 7    ______________________________________     ##STR11##     ##STR12##     ##STR13##    ______________________________________

If the number of data elements in each set exceeds 8 and is a multipleof 4, the multiplication and accumulation of these sets requires fewerinstructions if performed as shown in table 8 below.

                  TABLE 8    ______________________________________     ##STR14##     ##STR15##     ##STR16##     ##STR17##     ##STR18##     ##STR19##    ______________________________________

As another example, Table 9 shows the separate multiplication andaccumulation of sets A and B and sets C and D, where each of these setsincludes 2 data elements.

                  TABLE 9    ______________________________________     ##STR20##    ______________________________________

As another example, Table 10 shows the separate multiplication andaccumulation of sets A and B and sets C and D, where each of these setsincludes 4 data elements.

                  TABLE 10    ______________________________________     ##STR21##     ##STR22##     ##STR23##    ______________________________________

3) Dot Product Algorithms

Dot product (also termed as inner product) is used in signal processingand matrix operations. For example, dot product is used when computingthe product of matrices, digital filtering operations (such as FIR andIIR filtering), and computing correlation sequences. Since many speechcompression algorithms (e.g., GSM, G.728, CELP, and VSELP) and Hi-Ficompression algorithms (e.g., MPEG and subband coding) make extensiveuse of digital filtering and correlation computations, increasing theperformance of dot product increases the performance of thesealgorithms.

The dot product of two length N sequences A and B is defined as:##EQU1##

Performing a dot product calculation makes extensive use of the multiplyaccumulate operation where corresponding elements of each of thesequences are multiplied together, and the results are accumulated toform the dot product result.

The dot product calculation can be performed using the multiply-addinstruction. For example if the packed data type containing foursixteen-bit elements is used, the dot product calculation may beperformed on two sequences each containing four values by:

1) accessing the four sixteen-bit values from the A sequence to generateSource1 using a move instruction;

2) accessing four sixteen-bit values from the B sequence to generateSource2 using a move instruction; and

3) performing multiplying and accumulating as previously described usinga multiply-add, packed add, and shift instructions.

For vectors with more than just a few elements the method shown in Table10 is used and the final results are added together at the end. Othersupporting instructions include the packed OR and XOR instructions forinitializing the accumulator register, the packed shift instruction forshifting off unwanted values at the final stage of computation. Loopcontrol operations are accomplished using instructions already existingin the instruction set of processor 109.

4) Discrete Cosign Transform Algorithms

Discrete Cosine Transform (DCT) is a well known function used in manysignal processing algorithms. Video and image compression algorithms, inparticular, make extensive use of this transform.

In image and video compression algorithms, DCT is used to transform ablock of pixels from the spatial representation to the frequencyrepresentation. In the frequency representation, the picture informationis divided into frequency components, some of which are more importantthan others. The compression algorithm selectively quantizes or discardsthe frequency components that do not adversely affect the reconstructedpicture contents. In this manner, compression is achieved.

There are many implementations of the DCT, the most popular being somekind of fast transform method modeled based on the Fast FourierTransform (FFT) computation flow. In the fast transform, an order Ntransform is broken down to a combination of order N/2 transforms andthe result recombined. This decomposition can be carried out until thesmallest order 2 transform is reached. This elementary 2 transformkernel is often referred to as the butterfly operation. The butterflyoperation is expressed as follows:

    X=a*x+b*y

    Y=c*x-d*y

where a, b, c and d are termed the coefficients, x and y are the inputdata, and X and Y are the transform output.

The multiply-add allows the DCT calculation to be performed using packeddata in the following manner:

1) accessing the two 16-bit values representing x and y to generateSource1 (see Table 11 below) using the move and unpack instructions;

2) generating Source2 as shown in Table 11 below--Note that Source2 maybe reused over a number of butterfly operations; and

3) performing a multiply-add instruction using Source1 and Source2 togenerate the Result (see Table 11 below).

                  TABLE 11    ______________________________________     ##STR24##     ##STR25##     ##STR26##    ______________________________________

In some situations, the coefficients of the butterfly operation are 1.For these cases, the butterfly operation degenerates into just adds andsubtracts that may be performed using the packed add and packed subtractinstructions.

An IEEE document specifies the accuracy with which inverse DCT should beperformed for video conferencing. (See, IEEE Circuits and SystemsSociety, "IEEE Standard Specifications for the Implementations of 8×8Inverse Discrete Cosine Transform," IEEE Std. 1180-1990, IEEE Inc. 345East 47th St., NY, N.Y. 10017, USA, Mar. 18, 1991). The requiredaccuracy is met by the disclosed multiply-add instruction because ituses 16-bit inputs to generate 32-bit outputs.

In this manner, the described multiply-add instruction can be used toimprove the performance of a number of different algorithms, includingalgorithms that require the multiplication of complex numbers,algorithms that require transforms, and algorithms that require multiplyaccumulate operations. As a result, this multiply-add instruction can beused in a general purpose processor to improve the performance of agreater number algorithms than the described prior art instructions.

ALTERNATIVE EMBODIMENTS

While the described embodiment uses 16-bit data elements to generate32-bit data elements, alternative embodiments could use different sizedinputs to generate different sized outputs. In addition, while in thedescribed embodiment Source1 and Source 2 each contain 4 data elementsand the multiply-add instruction performs two multiply-add operations,alternative embodiment could operate on packed data having more or lessdata elements. For example, one alternative embodiment operates onpacked data having 8 data elements using 4 multiply-adds generating aresulting packed data having 4 data elements. While in the describedembodiment each multiply-add operation operates on 4 data elements byperforming 2 multiplies and 1 addition, alternative embodiments could beimplemented to operate on more or less data elements using more or lessmultiplies and additions. As an example, one alternative embodimentoperates on 8 data elements using 4 multiplies (one for each pair ofdata elements) and 3 additions (2 additions to add the results of the 4multiplies and 1 addition to add the results of the 2 previousadditions).

While the invention has been described in terms of several embodiments,those skilled in the art will recognize that the invention is notlimited to the embodiments described. The method and apparatus of theinvention can be practiced with modification and alteration within thespirit and scope of the appended claims. The description is thus to beregarded as illustrative instead of limiting on the invention.

What is claimed is:
 1. A computer-implemented method responsive to theexecution of a single instruction comprising the steps of:performing thefollowing steps in response to executing said single instruction,multiplying together a first value and a second value to generate afirst intermediate result, multiplying together a third value and afourth value to generate a second intermediate result, multiplyingtogether a fifth value and a sixth value to generate a thirdintermediate result, multiplying together a seventh value and an eighthvalue to generate a fourth intermediate result, subtracting togethersaid first intermediate result and said second intermediate result togenerate a first data element in a first packed data, performing anarithmetic operation on said third intermediate result and said fourthintermediate result to generate a second data element in said firstpacked data; storing said first packed data in a first storage area. 2.The method of claim 1, wherein said arithmetic operation is one ofaddition and subtraction.
 3. The method of claim 1, wherein execution ofsaid single instruction is completed without arithmetically combiningsaid first and second data elements of said first packed data.
 4. Themethod of claim 1, wherein said step of storing said first packed dataincludes the step of storing said first packed data as an operand foruse by another instruction.
 5. The method of claim 1, wherein said firstand second data elements of said first packed data each contain morebits than each of said first, second, third, fourth, and fifth values.6. The method of claim 1, wherein said first and second data elements ofsaid first packed data each contain twice as many bits as each of saidfirst, second, third, fourth, and fifth values.
 7. A method formanipulating a first packed data and a second packed data, said firstpacked data including A₁, A₂, A₃, and A₄ as data elements, said secondpacked data including B₁, B₂, B₃, and B₄ as data elements, said methodcomprising the computer-implemented steps of:performing the followingsteps in response to executing a single multiply-subtract instruction,performing the operation (A₁ ×B₁)-(A₂ ×B₂) to generate a first dataelement in a third packed data; performing the operation (A₃ ×B₃)-(A₄×B₄) to generate a second data element in said third packed data;storing said third packed data in a first storage area.
 8. The method ofclaim 7, wherein execution of said single multiply-subtract instructionis completed without arithmetically combining said first and second dataelements of said third packed data.
 9. The method of claim 7, whereinsaid step of storing said third packed data includes the step of storingsaid third packed data as an operand for use by another instruction. 10.The method of claim 7, wherein the data elements of said third packeddata each contain more bits than each of the data elements of said firstand second packed data.
 11. The method of claim 7, wherein the dataelements of said third packed data each contain twice as many bits asthe data elements of said first and second packed data.
 12. The methodof claim 7, wherein said step of storing said third packed data includesthe step of storing said third packed data over said first packed data.13. In a computer system having stored therein a first packed data and asecond packed data each containing initial data elements, each of saidinitial data elements in said first packed data having a correspondinginitial data element in said second packed data, a method for performingmultiply subtract operations, said method comprising the stepsof:performing the following steps in response to executing a singleinstruction, multiplying together said corresponding initial dataelements in said first packed data and said second packed data togenerate corresponding intermediate data elements, said intermediatedata elements being divided into a number of sets; subtracting theintermediate result data elements in at least a first of said number ofsets; storing the result of subtracting the first of said number of setsas a first of a plurality of result data elements; and storing saidresult data elements as a third packed data in a memory.
 14. The methodof claim 13, wherein a second of said plurality of result data elementsrepresents either the subtraction or the sum of said intermediate resultdata elements in a second of said number of sets.
 15. The method ofclaim 13, wherein execution of said single instruction is completedwithout arithmetically combining the result data elements of said thirdpacked data.
 16. The method of claim 13, wherein said step of storingsaid result data elements as said third packed data includes the step ofstoring said third packed data as an operand for use by anotherinstruction.
 17. The method of claim 13, wherein the data elements ofsaid third packed data each contain more bits than each of the dataelements of said first and second packed data.
 18. The method of claim13, wherein the data elements of said third packed data each containtwice as many bits as the data elements of said first and second packeddata.
 19. The method of claim 13, wherein said step of storing saidresult data elements as said third packed data includes the step ofstoring said third packed data over said first packed data.